t=int(input())
import math
while t:
n,m,num=map(int,input().strip().split())
r=(num-1)%n
c=math.ceil(num/n)
ans=r*m+c
print(ans)
t-=1
#include<iostream>
using namespace std;
int main(){
int T;
int x, y;
long long n;
cin >> T;
while(T--){
cin >> x >> y >> n;
long long c = n / x;
long long r = n - c * x;
if(n % x) c++;
if(r == 0) r = x;
cout << (r - 1) * y + c << endl;
}
return 0;
}
706B - Interesting drink | 1265A - Beautiful String |
214A - System of Equations | 287A - IQ Test |
1108A - Two distinct points | 1064A - Make a triangle |
1245C - Constanze's Machine | 1005A - Tanya and Stairways |
1663F - In Every Generation | 1108B - Divisors of Two Integers |
1175A - From Hero to Zero | 1141A - Game 23 |
1401B - Ternary Sequence | 598A - Tricky Sum |
519A - A and B and Chess | 725B - Food on the Plane |
154B - Colliders | 127B - Canvas Frames |
107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |